Enumeration of cyclic graphs and cyclic designs

Cyclic Graphs

A subclass of the class of circulant graphs is considered. It is shown that in this subclass, isomorphism is equivalent to Adam-isomorphism. Various results are obtained for the chromatic number, line-transitivity and the diameter.

Construction of Cyclic H-Designs

We consider a technique to construct cyclicH(3)-designs. Further, to illustrate the procedure, we consider and examine some concrete cases. Mathematics Subject Classification: 05C05

Cyclic Deficiency of Graphs

A proper edge coloring of a graph G with colors 1, 2, . . . , t is called a cyclic interval t-coloring if for each vertex v of G the edges incident to v are colored by consecutive colors, under the condition that color 1 is considered as consecutive to color t. In this paper we introduce and investigate a new notion, the cyclic deficiency of a graph G, defined as the minimum number of pendant e...

Quasi-Cyclic Codes from Cyclic-Structured Designs with Good Properties

Quasi-cyclic Codes from Cyclic-Structured Designs with Good Properties Dimitris E. Simos and Christos Koukouvinos Department of Mathematics National Technical University of Athens Zografou 15773, Athens, Greece {dsimos,ckoukouv}@math.ntua.gr Quasi-cyclic (QC) codes form an important class of linear codes, which contains the well-known class of cyclic codes. A linear code with a complementary du...

Decomposing triples into cyclic designs